Array codes in m-metric correcting independent and clustered errors simultaneously
نویسنده
چکیده
Array codes or two-dimensional codes in m-metric are subsets/subspaces of the space Matm×s(Fq), the linear space of all m × s-matrices with entries from a finite field Fq endowed with the m-metric [15]. In this paper, we obtain a lower bound over the number of parity checks of a two-dimensional m-code that corrects any two-dimensional array which has both clustered errors as well as errors in separate positions (or independent errors).
منابع مشابه
Generalized Minimum Distance Decoding for Correcting Array Errors
We consider an array error model for data in matrix form, where the corrupted symbols are confined to a number of lines (rows and columns) of the matrix. Codes in array metric (maximum term rank metric) are well suited for error correction in this case. We generalize the array metric to the case when the reliability of every line of the matrix is available. We propose a minimum distance decoder...
متن کاملAn Approach to Increasing Reliability Using Syndrome Extension
Computational errors in numerical data processing may be detected efficiently by using parity values associated with real number codes, even when inherent round off errors are allowed in addition to failure disruptions. This paper examines correcting turbo codes by straightforward application of an algorithm derived for finite-field codes, modified to operate over any field. There are syndromes...
متن کاملAn approach to fault detection and correction in design of systems using of Turbo codes
We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...
متن کاملDecoding of Cluster Array Errors in Row-Cyclic Array Codes
Row-cyclic array codes equipped with m-metric [13] suitable for parallel channel communication systems have been introduced by the first author in [10] and the notion of cluster/burst array errors were introduced by the first author in [6]. In this paper, we study cluster array errors detection and correction in row-cyclic array codes.
متن کاملLow-Complexity Codes for Random and Clustered High-Order Failures in Storage Arrays
RC (Random/Clustered) codes are a new efficient array-code family for recovering from 4-erasures. RC codes correct most 4-erasures, and essentially all 4-erasures that are clustered. Clustered erasures are introduced as a new erasure model for storage arrays. This model draws its motivation from correlated device failures, that are caused by physical proximity of devices, or by age proximity of...
متن کامل